// https://leetcode.cn/problems/sorted-merge-lcci/description/


func merge(A []int, m int, B []int, n int)  {
    l = m
	for i, v = range B {
		for j := l - 1; j > 0; j-- {
			if a[j] >= v {
				a[j + 1] = a[j]
			}
		}
		a[j + 1] = v
		l++
	}
}